message authentification algorithm - traducción al ruso
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

message authentification algorithm - traducción al ruso

OBSOLETE CRYPTOGRAPHIC HASH FUNCTION
Message Digest Algorithm 2; MD2 (cryptography)

message authentification algorithm      
алгоритм аутентификации сообщений
message passing         
MECHANISM FOR INTERPROCESS COMMUNICATION
Message passing programming; Message Passing; Message-based protocol; Message-passing; Message-based; Message (object-oriented programming); Asynchronous message passing; Synchronous message passing

общая лексика

передача сообщений, обмен сообщениями

один из двух способов организации взаимодействия между параллельными процессами (другой - shared memory)

algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650
<syntaxhighlight lang="text" highlight="1,5">
 1599 = 650×2 + 299
 650 = 299×2 + 52
 299 = 52×5 + 39
 52 = 39×1 + 13
 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus
algorithm noun math. алгоритм algorithm validation - проверка правильности алгоритма

Definición

message passing
One of the two techniques for communicating between parallel processes (the other being shared memory). A common use of message passing is for communication in a parallel computer. A process running on one processor may send a message to a process running on the same processor or another. The actual transmission of the message is usually handled by the run-time support of the language in which the processes are written, or by the operating system. Message passing scales better than shared memory, which is generally used in computers with relatively few processors. This is because the total communications bandwidth usually increases with the number of processors. A message passing system provides primitives for sending and receiving messages. These primitives may by either synchronous or asynchronous or both. A synchronous send will not complete (will not allow the sender to proceed) until the receiving process has received the message. This allows the sender to know whether the message was received successfully or not (like when you speak to someone on the telephone). An asynchronous send simply queues the message for transmission without waiting for it to be received (like posting a letter). A synchronous receive primitive will wait until there is a message to read whereas an asynchronous receive will return immediately, either with a message or to say that no message has arrived. Messages may be sent to a named process or to a named mailbox which may be readable by one or many processes. Transmission involves determining the location of the recipient and then choosing a route to reach that location. The message may be transmitted in one go or may be split into packets which are transmitted independently (e.g. using wormhole routing) and reassembled at the receiver. The message passing system must ensure that sufficient memory is available to buffer the message at its destination and at intermediate nodes. Messages may be typed or untyped at the programming language level. They may have a priority, allowing the receiver to read the highest priority messages first. Some message passing computers are the {MIT J-Machine (http://ai.mit.edu/projects/cva/cva_j_machine.html)}, the {Illinois Concert Project (http://www-csag.cs.uiuc.edu/projects/concert.html)} and transputer-based systems. Object-oriented programming uses message passing between objects as a metaphor for procedure call. (1994-11-11)

Wikipedia

MD2 (hash function)

The MD2 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers. MD2 is specified in IETF RFC 1319. The "MD" in MD2 stands for "Message Digest".

Even though MD2 is not yet fully compromised, the IETF retired MD2 to "historic" status in 2011, citing "signs of weakness". It is deprecated in favor of SHA-256 and other strong hashing algorithms.

Nevertheless, as of 2014, it remained in use in public key infrastructures as part of certificates generated with MD2 and RSA.

¿Cómo se dice message authentification algorithm en Ruso? Traducción de &#39message authentification